Interpreting one concurrent calculus in another
نویسندگان
چکیده
منابع مشابه
Re-interpreting the Modal -calculus
We reexamine the modal-calculus in the light of some classical theory of Boolean algebras and recent results on duality theory for a modal logic with xed points. We propose interpreting formulas into a eld of subsets of states instead of the full power set lattice used by Kozen. Under this interpretation we relate image compact modal frames with Scott continuity of the box modality, m-saturated...
متن کاملInterpreting HOL in the calculus of constructions
The purpose of this paper is to consider a representation of the HOL theorem-prover in the calculus of constructions with the property that consistency results from the calculus of constructions imply such results in HOL. This kind of representation is impossible using the propositions-as-types representation of logic and equality, but it is possible if a different representation is used.
متن کاملInterpreting Nondeterminism in the Refinement Calculus
We introduce a simple programming language and define its predicate transformer semantics. We motivate the choice of the constructs for the language by algebraic arguments, showing that the constructs are essentially the basic algebraic operations that are available for predicate transformers, when these are viewed as forming a complete lattice enriched category. We then show that the statement...
متن کاملFrom a Concurrent - calculus to the - calculus ?
We explore the (dynamic) semantics of a simply typed-calculus enriched with parallel composition, dynamic channel generation, and input-output communication primitives. The calculus, called the k-calculus, can be regarded as the kernel of concurrent-functional languages such as LCS, CML and Facile, and it can be taken as a basis for the definition of abstract machines, the transformation of pro...
متن کاملConcurrent Pattern Calculus
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. By generalising from pattern matching to unification, interaction becomes symmetrical, with information flowing in both directions. This provides a natural language for describing any form of exchange or tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90059-q